Complex-Balanced Steady States of Chemical Reaction Networks that Contain an Eulerian Cycle
نویسنده
چکیده
This work pertains to chemical reaction networks and their equilibria, called steady-states. Our main result states that for a cyclic chemical reaction network, there is a straightforward characterization for when a complex balancing steady state exists. We then extend our results to chemical reaction networks consisting of a closed path traversing each directed edge exactly once.
منابع مشابه
Node Balanced Steady States: Unifying and Generalizing Complex and Detailed Balanced Steady States.
We introduce a unifying and generalizing framework for complex and detailed balanced steady states in chemical reaction network theory. To this end, we generalize the graph commonly used to represent a reaction network. Specifically, we introduce a graph, called a reaction graph, that has one edge for each reaction but potentially multiple nodes for each complex. A special class of steady state...
متن کاملNonequilibrium Thermodynamics of Chemical Reaction Networks: Wisdom from Stochastic Thermodynamics
We build a rigorous nonequilibrium thermodynamic description for open chemical reaction networks of elementary reactions. Their dynamics is described by deterministic rate equations with mass action kinetics. Our most general framework considers open networks driven by time-dependent chemostats. The energy and entropy balances are established and a nonequilibrium Gibbs free energy is introduced...
متن کاملComputing fluxes and chemical potential distributions in biochemical networks: energy balance analysis of the human red blood cell
The analysis of non-equilibrium steady states of biochemical reaction networks relies on finding the configurations of fluxes and chemical potentials satisfying stoichiometric (mass balance) and thermodynamic (energy balance) constraints. Efficient methods to explore such states are crucial to predict reaction directionality, calculate physiologic ranges of variability, estimate correlations, a...
متن کامل0n removable cycles in graphs and digraphs
In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...
متن کاملThe Simulation and Control of Ammonia Unit of Shiraz Petrochemical Complex, Iran
The aim of this paper is the steady state and dynamic simulations of the ammonia unit of Shiraz petrochemical complex and system behavior study versus the feed flow rate change for producing a good quality product. The ammonia unit consists of the reformer units, shift converter units, carbon dioxide absorption unit, methanation unit, and ammonia synthesis unit. For this purpose, in the first s...
متن کامل